Designing Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
نویسندگان
چکیده مقاله:
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and each of robot links and proper inequality equations have been derived which describe the qualification of obstacle avoidance. Moreover, nonlinear optimization problem with nonlinear constraint functions has been derived by considering the joint physical limits. In order to design the neural network, equivalent problem of projection theorem has been converted to quadratic programming by using Kuhn-Tucker 1optimality conditions. Based on the projection theorem, model of recurrent neural network has been determined which is as a first order differential equation. Simulation results show the good performance of the proposed method by applying the proposed algorithm on the seven-degree freedom PA-10 robot.
منابع مشابه
Using a Neural Network instead of IKM in 2R Planar Robot to follow rectangular path
Abstract— An educational platform is presented here for the beginner students in the Simulation and Artificial Intelligence sciences. It provides with a start point of building and simulation of the manipulators, especially of 2R planar Robot. It also displays a method to replace the inverse kinematic model (IKM) of the Robot with a simpler one, by using a Multi-Layer Perceptron Neural Network ...
متن کاملOptimal Robot Path Planning with Cellular Neural Network
This paper presents a new methodology based on neural dynamics for optimal robot path planning by drawing an analogy between cellular neural network (CNN) and path planning of mobile robots. The target activity is treated as an energy source injected into the neural system and is propagated through the local connectivity of cells in the state space by neural dynamics. By formulating the local c...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولLocal Path Planning with Proximity Sensing for Robot Arm Manipulators
In this paper, the problem of sensor-based path planning for robot arm manipulators operating among unknown obstacles of arbitrary shape is considered. It has been known that, in principle, algorithms with proven convergence can be designed for planar and simple three-dimensional robot arms operating under such conditions. However, implementation of such algorithms presents a variety of problem...
متن کاملA Mathematical Model for City Logistics Distribution Network Design with the Aim of Minimizing Response Time
Recently, urbanization has been expanded rapidly in the world and a number of metropolitan areas have been appeared with a population of more than 10 million people. Because of dense population in metropolitan and consequently increasing the delivery of goods and services, there has been a lot of problems including traffic congestion, air pollution, accidents and high energy consumption. This m...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 5 شماره 20
صفحات 1- 8
تاریخ انتشار 2017-03-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023